Explicit temporal models for decision-theoretic planning of clinical management

نویسنده

  • Niels Peek
چکیده

The management of patients over a prolonged period of time is a complicated task involving both diagnostic and prognostic reasoning with incomplete and often uncertain knowledge. Various formalisations of this type of task exist, but these often conceal one or more essential ingredients of the problem. This article explores the suitability of partially observable Markov decision processes to formalising the planning of clinical management. These processes allow for explicit representation of clinical states of the patient, the management strategy employed, the objectives of treatment, and the role of time and change in reasoning. However, practical application is hampered by their coarse representational granularity and complex formulation. It is discussed how probabilistic network representations can be used to alleviate these obstacles. The resulting method is illustrated with a real-world example from the domain of paediatric cardiology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstraction and Approximate Decision-Theoretic Planning

ion and Approximate Decision Theoretic Planning Richard Dearden and Craig Boutiliery Department of Computer Science University of British Columbia Vancouver, British Columbia CANADA, V6T 1Z4 email: dearden,[email protected] Abstract Markov decision processes (MDPs) have recently been proposed as useful conceptual models for understanding decision-theoretic planning. However, the utility of the as...

متن کامل

A More Expressive Behavioral Logic for Decision-Theoretic Planning

We examine the problem of compactly expressing models of non-Markovian reward decision processes (NMRDP). In the field of decision-theoretic planning NMRDPs are used whenever the agent’s reward is determined by the history of visited states. Two different propositional linear temporal logics can be used to describe execution histories that are rewarding. Called PLTL and $FLTL, they are backward...

متن کامل

Planning and Programming with First-Order Markov Decision Processes: Insights and Challenges

Markov decision processes (MDPs) have become the de facto standard model for decision-theoretic planning problems. However, classic dynamic programming algorithms for MDPs [22] require explicit state and action enumeration. For example, the classical representation of a value function is a table or vector associating a value with each system state; such value functions are produced by iterating...

متن کامل

A mixed Bayesian/Frequentist approach in sample size determination problem for clinical trials

In this paper we introduce a stochastic optimization method based ona mixed Bayesian/frequentist approach to a sample size determinationproblem in a clinical trial. The data are assumed to come from a nor-mal distribution for which both the mean and the variance are unknown.In contrast to the usual Bayesian decision theoretic methodology, whichassumes a single decision maker, our method recogni...

متن کامل

Decision-theoretic refinement planning in medical decision making: management of acute deep venous thrombosis.

Decision-theoretic refinement planning is a new technique for finding optimal courses of action. The authors sought to determine whether this technique could identify optimal strategies for medical diagnosis and therapy. An existing model of acute deep venous thrombosis of the lower extremities was encoded for analysis by the decision-theoretic refinement planning system (DRIPS). The encoding r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Artificial intelligence in medicine

دوره 15 2  شماره 

صفحات  -

تاریخ انتشار 1999